Distributed match-making for processes in computer networks
نویسندگان
چکیده
منابع مشابه
Advance Reservation in Distributed Computer Networks Advance Reservation in Distributed Computer Networks Advance Reservation in Distributed Computer Networks
OF DISSERTATION Submitted in Partial Fulfillment of the Requirements for the Degree of Doctor of Philosophy Engineering The University of New Mexico Albuquerque, New Mexico
متن کاملResilience-Based Framework for Distributed Generation Planning in Distribution Networks
Events with low probability and high impact, which annually cause high damages, seriously threaten the health of the distribution networks. Hence, more attention to the issue of enhancing network resilience and continuity of power supply, feels more than ever, all over the world. In modern distribution networks, because of the increasing presence of distributed generation resources, an alternat...
متن کاملA Reconfiguration Algorithm for Distributed Computer Networks
This article presents an algorithmic reconfiguration model, combining mechanisms of load balancing and fault tolerance in order to increase utilization of computer resources in a distributed multi-server, multitasking environment. The model has been empirically tested in a network of computers controlling telecommunication hubs and is compared to previous efforts to address this challenge.
متن کاملMatch-Making in Bartering Scenarios
This thesis extends tree similarity based match-making from the buyer/seller situation to a scenario of bilateral bartering and multi-agent ring bartering. It is built on top of the AgentMatcher tree similarity algorithm for node-labelled, arc-labelled, arc-weighted trees. A representation of these trees in a multi-dimensional space is developed to allow efficient indexing and pruning in large ...
متن کاملThe match - making
This paper discusses a cryptographic protocol to evaluate an and-gate such that a party can keep his input bit secret from the other party. Such a protocol is of interest, because it can be generalized to any logical circuit for any number of participants. A formal statement of this generalization reads as follows: n participants want to compute together a function f(x1; x2; :::; xn) with xi be...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM SIGOPS Operating Systems Review
سال: 1986
ISSN: 0163-5980
DOI: 10.1145/12481.12484